Classification of Bipartite Boolean Constraint Satisfaction through Delta-Matroid Intersection
نویسندگان
چکیده
منابع مشابه
Concentration inequalities for nonlinear matroid intersection
In this work we propose new randomized rounding algorithms for matroid intersection and matroid base polytopes. We prove concentration inequalities for polynomial objective functions and constraints that has numerous applications and can be used in approximation algorithms for Minimum Quadratic Spanning Tree, Unrelated Parallel Machines Scheduling and Scheduling with Time Windows and Nonlinear ...
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Matching Problems with Delta-Matroid Constraints
Given an undirected graph G = (V,E) and a delta-matroid (V,F), the delta-matroid matching problem is to find a maximum cardinality matching M such that the set of the end vertices of M belongs to F . This problem is a natural generalization of the matroid matching problem to delta-matroids, and thus it cannot be solved in polynomial time in general. This paper introduces a class of the delta-ma...
متن کاملConstraint satisfaction: a personal perspective
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecidability. These classes, including NP, admit a logic formulation. By suitably restricting the formulation, one finds the logic class MMSNP, or monotone monadic strict NP without inequality, as a largest class that seems...
متن کاملThe complexity of approximating conservative counting CSPs
We study the complexity of approximation for a weighted counting constraint satisfaction problem #CSP(F). In the conservative case, where F contains all unary functions, a classification is known for the Boolean domain. We give a classification for problems with general finite domain. We define weak log-modularity and weak log-supermodularity, and show that #CSP(F) is in FP if F is weakly log-m...
متن کاملValuated Matroid Intersection I: Optimality Criteria
The independent assignment problem (or the weighted matroid intersection problem) is extended using Dress-Wenzel’s matroid valuations, which are attached to the vertex set of the underlying bipartite graph as an additional weighting. Specifically, the problem considered is: Given a bipartite graph G = (V , V −;A) with arc weight w : A → R and matroid valuations ω and ω− on V + and V − respectiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Discrete Math.
دوره 20 شماره
صفحات -
تاریخ انتشار 2005